Applications of Fixed-Point and Optimization Methods to the Multiple-Set Split Feasibility Problem
نویسندگان
چکیده
منابع مشابه
Applications of Fixed-Point and Optimization Methods to the Multiple-Set Split Feasibility Problem
The multiple-set split feasibility problem requires finding a point closest to a family of closed convex sets in one space such that its image under a linear transformation will be closest to another family of closed convex sets in the image space. It can be amodel for many inverse problemswhere constraints are imposed on the solutions in the domain of a linear operator as well as in the operat...
متن کاملViscosity approximation methods for the multiple-set split equality common fixed-point problems of demicontractive mappings
In this paper, we consider a new parallel algorithm combining viscosity approximation methods to approximate the multiple-set split common fixed point problem governed by demicontractive mappings, and get the generated sequence converges strongly to a solution of this problem. The results obtained in this paper generalize and improve the recent ones announced by many others. c ©2017 All rights ...
متن کاملSelf-Adaptive and Relaxed Self-Adaptive Projection Methods for Solving the Multiple-Set Split Feasibility Problem
and Applied Analysis 3 half-spaces, so that the algorithm is implementable. We need not estimate the Lipschitz constant and make a sufficient decrease of the objection function at each iteration; besides, these projection algorithms can reduce to the modifications of the CQ algorithm 6 when the MSSFP 1.1 is reduced to the SFP. We also show convergence the algorithms under mild conditions.
متن کاملA fixed point optimization algorithm for the equilibrium problem over the fixed point set and its applications
We discuss the equilibrium problem for a continuous bifunction over the fixed point set of a firmly nonexpansive mapping. We then present an iterative algorithm, which uses the firmly nonexpansive mapping at each iteration, for solving the problem. The algorithm is quite simple and it does not require monotonicity and Lipschitz-type condition on the equilibrium function. At the end of the paper...
متن کاملRegularized Methods for the Split Feasibility Problem
and Applied Analysis 3 However, 1.8 is, in general, ill posed. So regularization is needed. We consider Tikhonov’s regularization min x∈C fα : 1 2 ∥I − PQ ) Ax ∥∥2 1 2 α‖x‖, 1.9 where α > 0 is the regularization parameter. We can compute the gradient ∇fα of fα as ∇fα ∇f x αI A∗ ( I − PQ ) A αI. 1.10 Define a Picard iterates x n 1 PC ( I − γA∗I − PQ ) A αI )) x n 1.11 Xu 20 shown that if the SFP...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Mathematics
سال: 2012
ISSN: 1110-757X,1687-0042
DOI: 10.1155/2012/927530